/*
https://leetcode.cn/problems/minimum-insertion-steps-to-make-a-string-palindrome/submissions/583054225/
让字符串成为回文串的最少插入参数
区间dp
*/
class Solution
{
public:
    int minInsertions(string s)
    {
        int n = s.size();
        vector<vector<int>> dp(n,vector<int>(n));
        for(int i = n-1;i>=0;i--)
        {
            for(int j = i+1;j<n;j++)
            {
                if(s[i]==s[j]) dp[i][j] = dp[i+1][j-1];
                else dp[i][j] = min(dp[i+1][j]+1,dp[i][j-1]+1);
            }
        }
        return dp[0][n-1];
    }
};